Spintronics-compatible Approach to Solving Maximum-Satisfiability Problems with Probabilistic Computing, Invertible Logic, and Parallel Tempering

The search of hardware-compatible strategies for solving NP-hard combinatorial optimization problems (COPs) is an important challenge today s computing research because their wide range applications in real world problems. Here, we introduce unconventional scalable approach to face maximum satisfiability (Max-SAT) which combines probabilistic with p-bits, parallel tempering, and the concept invertible logic gates. We theoretically show spintronic implementation this based on a coupled set Landau-Lifshitz-Gilbert equations, showing potential path energy efficient very fast (p-bits exhibiting ns time scale switching) architecture solution COPs. algorithm benchmarked hard Max-SAT instances from 2016 competition (e.g., HG-4SAT-V150-C1350-1.cnf can be described 2851 p-bits), including weighted Max-Cut